Performance analysis of preconditioners based on Broyden method

نویسندگان

  • Peng Jiang
  • Geng Yang
چکیده

Solving nonlinear equations is a problem often needed to be dealt with in the practical engineering application. This paper discusses preconditioning methods based on Block Broyden method. It first introduces the Block Broyden method and preconditioning technique. Then it presents four different preconditioners for the Block Broyden method and discusses the implementation process. It also analyzes the time complexity of the four algorithms. Finally, it solves the nonlinear systems arising from the Bratu problem by the four preconditioning algorithms. Experimental results show that the preconditioning technique is effective for the Block Broyden method and that the preconditioner SSOR has the fastest solving speed and the best performance among the four preconditioners. Therefore, it can be used in the large-scale problems arising from scientific and engineering computing. 2005 Elsevier Inc. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SSOR and ASSOR preconditioners for Block-Broyden method

Solving nonlinear equations is a problem that needs to be dealt with in the practical engineering application. This paper uses Block–Broyden method for solving large-scale nonlinear systems, and two preconditioners are applied for solving the underlying linear systems, including SSOR preconditioner as well as ASSOR method, which is based on SSOR. It discusses their implementation processes and ...

متن کامل

Band preconditioners for the matrix-free truncated Newton method

This report is devoted to preconditioning techniques for the matrix-free truncated Newton method. After a review of basic known approaches, we propose new results concerning tridiagonal and pentadiagonal preconditioners based on the standard BFGS updates and on numerical differentiation. Furthermore, we present results of extensive numerical experiments serving for the careful comparison of sui...

متن کامل

Low-rank update of preconditioners for the inexact Newton method with SPD Jacobian

In this note preconditioners for the Conjugate Gradient method are studied to solve the Newton system with a symmetric positive definite Jacobian. In particular, we define a sequence of preconditioners built by means of BFGS rank-two updates. Reasonable conditions are derived which guarantee that the preconditioned matrices are not far from the identity in a matrix norm. Some notes on the imple...

متن کامل

AINVK: a Class of Approximate Inverse Preconditioners based on Krylov-subspace methods, for Large Indefinite Linear Systems

We propose a class of preconditioners for symmetric linear systems arising from numerical analysis and nonconvex optimization frameworks. Our preconditioners are specifically suited for large indefinite linear systems and may be obtained as by-product of Krylov-subspace solvers, as well as by applying L-BFGS updates. Moreover, our proposal is also suited for the solution of a sequence of linear...

متن کامل

A Theory of Secant Preconditioners

In this paper we analyze the use of structured quasi-Newton formulae as preconditioners of iterative linear methods when the inexact-Newton approach is employed for solving nonlinear systems of equations. We prove that superlinear convergence and bounded work per iteration is obtained if the preconditioners satisfy a Dennis-Moré condition. We develop a theory of LeastChange Secant Update precon...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 178  شماره 

صفحات  -

تاریخ انتشار 2006